Computing 2-Terminal Reliability of Probe Interval Graphs
نویسندگان
چکیده
Consider a probabilistic graph G in which the edges are perfectly reliable, but vertices may fail with some known probabilities. The 2-terminal reliability of G is defined as the probability that one operational path exists between a given source and destination pair vertices of G. This 2-terminal reliability problem is known to be #P-complete for general graphs but solvable in polynomial time for interval graphs. This work presents a polynomial-time algorithm for computing the 2-terminal reliability of probe interval graphs, which is a superclass of interval graphs.
منابع مشابه
)-time algorithm for computing the K-terminal reliability of rooted directed path graphs
Let G denote a graph, and KV(G) represent a set of target vertices. Assume that the non-target vertices of G fail independently with given probabilities. The K-terminal reliability of G is defined as the probability that all target vertices in K are connected. Computing K-terminal reliability is #P-complete for general graphs, yet solvable in polynomial time for interval graphs. This work prop...
متن کاملComputing the K-terminal Reliability of Circle Graphs
Let G denote a graph and let K be a subset of vertices that are a set of target vertices of G. The Kterminal reliability of G is defined as the probability that all target vertices in K are connected, considering the possible failures of non-target vertices of G. The problem of computing K-terminal reliability is known to be #P-complete for polygon-circle graphs, and can be solved in polynomial...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملComputing tolerance interval for binomial random variable
Tolerance interval is a random interval that contains a proportion of the population with a determined confidence level and is applied in many application fields such as reliability and quality control. In this educational paper, we investigate different methods for computing tolerance interval for the binomial random variable using the package Tolerance in statistical software R.
متن کاملA Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
Let G (V, E) be a graph whose edges may fail with known probabilities and let K _ V be specified. The K-terminal reliability of G, denoted R(GK), is the probability that all vertices in K are connected. Computing R(G:) is, in general, NP-hard. For some series-parallel graphs, R(Gn) can be computed in polynomial time by repeated application of well-known reliability-preserving reductions. Howeve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015